Computational complexity of learning algebraic varieties
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Solving Real Algebraic Formulae
where e e IR", b e IR" and A is an m x n matrix. In the last four years there has been a vast amount of work on "interior point" algorithms, motivated by Karmarkar's algorithm [16]. Unlike the traditional simplex method which moves from vertex to vertex around the feasible region {x;>4x > b}, interior point methods proceed through the interior {x;Ax > b] of the feasible region. Karmarkar's algo...
متن کاملOn the complexity of counting components of algebraic varieties
We give a uniform method for the two problems of counting the connected and irreducible components of complex algebraic varieties. Our algorithms are purely algebraic, i.e., they use only the field structure of C. They work in parallel polynomial time, i.e., they can be implemented by algebraic circuits of polynomial depth. The design of our algorithms relies on the concept of algebraic differe...
متن کاملAn Algebraic Approach to Computational Complexity
The theory of computational complexity is concerned with identifying methods for computing solutions to problems in a minimal number of steps. Despite the diversity of application areas from which such problems can be drawn this theory has been successful in identifying a small number of fundamental questions on which a sizable fraction of the field hangs. A prime example is the P = ?ÎTP questi...
متن کاملAlgebraic Methods in Computational Complexity Dagstuhl Seminar
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 Algebraic Methods in Computational Complexity was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are ...
متن کاملAdvanced Course in Machine Learning the Computational Complexity of Learning the Computational Complexity of Learning-1
Usually, the computational complexity of an algorithm is analyzed as a function of its input size. When dealing with a learning algorithm, the input is a training set of examples. So, one can think that the computational complexity of a learning algorithm should be analyzed as a function of the training set size. However, this is clearly a wrong choice —having more examples should never increas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2020
ISSN: 0196-8858
DOI: 10.1016/j.aam.2020.102100